Quantum Error Correcting Codes

نویسندگان

  • Peter Májek
  • Andrew M. Steane
چکیده

This thesis deals with quantum error correcting codes. In first two chapters necessary introduction to quantum computation and classical error correction is presented. Previous results on construction of quantum error correcting codes are presented in the third and fourth chapter. Mainly Calderbank-Steane-Shor (CSS) codes and stabilizer codes are discussed together with the introduction to coding, decoding and recovery circuits’ construction. Second part of the thesis presents our own results. We have concentrated our effort on the exploration of new CSS codes and examination of their usability. CSS codes are presented as a wide class of quantum codes in literature, but conditions for their practical construction are quite complicated. Well known CSS codes are Steane code correcting errors on a single qubit and [[23,1,7]] code derived from Golay code (correcting three errors). However, no CSS code encoding one logical qubit and correcting errors on up to two qubits is established in the field of quantum error correction. Such code would need to use at least seventeen encoding qubits. We present probabilistic algorithm searching for CSS codes. We used this algorithm and found [[19,1,5]] CSS code. It remains an open question whether 17 or 18 qubits will suffice to construct a CSS code correcting two arbitrary errors. In last two chapters of the thesis results of numerical and theoretical analysis of found [[19,1,5]] code are shown. The concept of fault tolerant quantum computation is used in the analysis. Found [[19,1,5]] code is compared to Steane code. It follows that [[19,1,5]] CSS code provides better results than Steane code, if fault rate of used quantum gates is below 2, 5.10−4. We have optimized fault tolerant error correction schema for [[19,1,5]] code using the analysis and numerical simulations of several potential architectures. Probability that [[19,1,5]] code would fail to protect encoded qubit is shown (theoretically and also experimentally) to be O(ξ), where ξ is probability of single gate failure. In the thesis also coding, decoding and recovery circuits for found [[19,1,5]] code are designed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Relations between Classical and Quantum Error{correcting Codes ?

In this survey we describe relations between classical and quantum error{correcting codes. After a brief introduction to both quantum computation and classical linear error{correcting codes, we show how to construct quantum error{correcting codes based on classical ones. Furthermore, quantum circuits for encoding and syndrome computation are presented.

متن کامل

Constructing Quantum Error-Correcting Codes for p-State Systems from Classical Error-Correcting Codes∗

Quantum error-correcting codes have attracted much attention. Among many research articles, the most general and systematic construction is the so called stabilizer code construction [6] or additive code construction [2], which constructs a quantum error-correcting code as an eigenspace of an Abelian subgroup S of the error group. Thereafter Calderbank et al. [3] proposed a construction of S fr...

متن کامل

Chiral spin liquids and quantum error-correcting codes

The possibility of using the twofold topological degeneracy of spin-1/2 chiral spin liquid states on the torus to construct quantum error-correcting codes is investigated. It is shown that codes constructed using these states on finite periodic lattices do not meet the necessary and sufficient conditions for correcting even a single qubit error with perfect fidelity. However, for large enough l...

متن کامل

Some good quantum error-correcting codes from algebraic-Geometric codes

It is shown that the quantum error-correction can be acheived by the using of classical binary codes or additive codes over F4 (see [1],[2],[3]). In this paper with the help of some algebraic techniques the theory of algebraic-geometric codes is used to construct asymptotically good family of quantum error-correcting codes and other classes of good quantum error-correcting codes. Our results ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005